package org.yh.demo.algorithm;

import java.nio.charset.Charset;

public class BinaryTreeVer {


    public static void main(String[] args) {
        System.out.println("a在".getBytes().length);
        System.out.println("在".getBytes().length);

        System.out.println("a在".getBytes(Charset.forName("utf-8")).length);
        System.out.println("在".getBytes(Charset.forName("utf-8")).length);

        System.out.println("a在".getBytes(Charset.forName("gbk")).length);
        System.out.println("在".getBytes(Charset.forName("gbk")).length);

    }
}

class TreeNode {
    int val;
    TreeNode left;
    TreeNode right;
    TreeNode() {}
    TreeNode(int val) { this.val = val; }
    TreeNode(int val, TreeNode left, TreeNode right) {
        this.val = val;
        this.left = left;
        this.right = right;
    }
}